-
1 reducible automorphism
Большой англо-русский и русско-английский словарь > reducible automorphism
-
2 reducible automorphism
Математика: приводимый автоморфизмУниверсальный англо-русский словарь > reducible automorphism
-
3 reducible automorphism
English-Russian scientific dictionary > reducible automorphism
-
4 приводимый автоморфизм
Большой англо-русский и русско-английский словарь > приводимый автоморфизм
-
5 group
1) группа, ансамбль || групповой- roughing mill group2) совокупность; комплект3) группировка || группировать(ся)5) класс; категория || классифицировать; категоризировать6) хим. остаток7) сгусток; скопление8) узел9) матем. группа- absolute free group - absolute homotopy group - absolutely irreducible group - absolutely simple group - additively written group - adele group - adelic group - algebraically compact group - algebraically simple group - almost connected group - almost cyclic group - almost ordered group - almost periodic group - almost simple group - alternating form group - cancellative group - cellular homology group - characteristically simple group - complementing group - completely anisotropic group - completely discontinuous group - completely divisible group - completely indecomposable group - completely integrally closed group - deficient group - direct homology group - direct indecomposable group - doubly transitive group - finitely defined group - finitely generated group - finitely presented group - finitely related group - first homology group - first homotopy group - freely generated group - full linear group - full orthogonal group - full rotation group - full symmetric group - full unimodular group - group of classes of algebras - group of covering transformations - group of finite rank - group of infinite order - group of infinite rank - group of inner automorphisms - group of linear equivalence - group of linear forms - group of linear manifold - group of principal ideles - group of real line - group of recursive permutations - group of right quotients - idele class group - linearly ordered group - linearly transitive group - locally bicompact group - locally closed group - locally compact group - locally connected group - locally cyclic group - locally defined group - locally embeddable group - locally finite group - locally free group - locally infinite group - locally nilpotent group - locally normal group - locally solvable group - multiply primitive group - multiply transitive group - nonsolvable group - n-th homotopy group - ordered pair group - principal congruence group - properly orthogonal group - properly unimodular group - pure projective group - pure rotation group - pure simple group - quasipure projective group - quotient divisible group - residually nilpotent group - restricted holonomy group - sharply transitive group - simply ordered group - simply reducible group - simply transitive group - singular cogomology group - singular homology group - solvable group - stable group - strictly transitive group - strongly polycyclic group - subsolvable group - supersolvable group - totally ordered group - totally projective group - totally reducible group - triply transitive group - unitary symmetry group - unitary transformation group - value group - weak homology group - weakly mixing groupgroup with multiple operators — группа с многоместными операторами, мультиоператорная группа
-
6 module
1) модуль || разбивать на модули2) блок, узел3) коэффициент4) строит. модульная секция•module in space — мат. модуль в пространстве
module on space — мат. модуль на пространстве
module with differentiation — мат. дифференциальный модуль, модуль с дифференциалом
module with filtration — мат. модуль с фильтрацией
module without torsion — мат. модуль без кручения
См. также в других словарях:
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Group representation — In the mathematical field of representation theory, group representations describe abstract groups in terms of linear transformations of vector spaces; in particular, they can be used to represent group elements as matrices so that the group… … Wikipedia
Deligne–Lusztig theory — In mathematics, Deligne–Lusztig theory is a way of constructing linear representations of finite groups of Lie type using ℓ adic cohomology with compact support, introduced by Deligne Lusztig (1976). Lusztig (1984) used these representations to… … Wikipedia
Representation theory — This article is about the theory of representations of algebraic structures by linear transformations and matrices. For the more general notion of representations throughout mathematics, see representation (mathematics). Representation theory is… … Wikipedia
Spinor — In mathematics and physics, in particular in the theory of the orthogonal groups (such as the rotation or the Lorentz groups), spinors are elements of a complex vector space introduced to expand the notion of spatial vector. Unlike tensors, the… … Wikipedia
Emmy Noether — Amalie Emmy Noether Born 23 March 1882(1882 03 23) … Wikipedia
Regular representation — In mathematics, and in particular the theory of group representations, the regular representation of a group G is the linear representation afforded by the group action of G on itself. ignificance of the regular representation of a groupTo say… … Wikipedia
Braid group — In mathematics, the braid group on n strands, denoted by B n , is a certain group which has an intuitive geometrical representation, and in a sense generalizes the symmetric group S n . Here, n is a natural number; if n gt; 1, then B n is an… … Wikipedia
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
Noether — Emmy Noether Emmy Noether Amalie Emmy Noether (23 mars 1882 14 avril 1935) était une mathématicienne allemande connue pour ses contributions révolutionnaires en algèbre abstraite et physique théorique. Décrite par Albert Einstein et d autres… … Wikipédia en Français